Fuzzy counters for NVS to reduce lock contention

ABSTRACT

A method for data management in a computing storage environment includes a processor device, operable in the computing storage environment, that divides a plurality of counters tracking write and discard storage operations through Non Volatile Storage (NVS) space into first, accurate, and second, fuzzy, groups where the first, accurate, group is one of updated on a per operation basis, while the second, fuzzy, group is one of updated on a more infrequent basis as compared to the first, accurate group.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.14/066,075, filed on Oct. 29, 2013, which is a Continuation of U.S.patent application Ser. No. 13/629,808, filed on Sep. 28, 2012, now U.S.Pat. No. 9,122,576.

FIELD OF THE INVENTION

The present invention relates in general computing systems, and moreparticularly to, systems and methods for increased data managementefficiency in computing storage environments.

DESCRIPTION OF THE RELATED ART

In today's society, computer systems are commonplace. Computer systemsmay be found in the workplace, at home, or at school. Computer systemsmay include data storage systems, or disk storage systems, to processand store data. Contemporary computer storage systems are known todestage, and subsequently, demote storage tracks from cache to long-termstorage devices so that there is sufficient room in the cache for datato be written.

SUMMARY OF THE INVENTION

Various embodiments for data management in a computing storageenvironment are provided. In one embodiment, by way of example only, amethod for data management by a processor device in a computing storageenvironment, is provided. A plurality of counters tracking write anddiscard storage operations through Non Volatile Storage (NVS) space isdivided into first, accurate, and second, fuzzy, groups where the first,accurate, group is one of updated on a per operation basis, while thesecond, fuzzy, group is one of updated on a more infrequent basis ascompared to the first, accurate group.

Other system and computer program product embodiments are provided andsupply related advantages.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. Understanding that thesedrawings depict only typical embodiments of the invention and are nottherefore to be considered to be limiting of its scope, the inventionwill be described and explained with additional specificity and detailthrough the use of the accompanying drawings, in which:

FIG. 1 is an exemplary block diagram showing a hardware structure forcache management in which aspects of the present invention may berealized;

FIG. 2 is an exemplary block diagram showing a hardware structure of adata storage system in a computer system according to the presentinvention in which aspects of the present invention may be realized;

FIG. 3 is a flow chart diagram illustrating an exemplary method forincreased efficiency in data management in a computing storageenvironment, again in which aspects of the present invention may berealized;

FIG. 4 is an additional flow chart diagram illustrating an exemplarymethod for performing various operations for data managementenhancement, again in which aspects of the present invention may beimplemented;

FIG. 5 is an additional flow chart diagram illustrating an additionalexemplary method for performing various operations for data managementenhancement, again in which aspects of the present invention may beimplemented; and

FIG. 6 is an additional flow chart diagram illustrating an additionalexemplary method for performing various operations for data managementenhancement, again in which aspects of the present invention may beimplemented.

DETAILED DESCRIPTION OF THE DRAWINGS

Computing storage environments featuring Cached control units maythreshold, or set limits, on an amount of Non Volatile Storage (NVS)space that ranks of storage are allowed to consume at any particulartime. This prevents a single rank failure, for example, from consumingall of NVS space, and allows for multiple rank failures before all ofNVS is consumed by failed ranks.

In one storage environment, a collection of counters, such as those thatmonitor (1) rank; (2) rank group (e.g., Enterprise, Spinning Disk, SolidState Devices); (3) point-in-time copy source (e.g., Flash Copy Source);(4) overall overwrite segment count; (5) overall segments; and (6)overall tracks; are controlled under a single lock, and are updated forevery write to NVS and every discard from NVS, and are kept completelyaccurate.

Additionally, in one storage environment, so-called “Segment Levels” aredefined, which may include (1) Quiesce (nearly empty); (2) Trigger(getting full), and (3) Priority (full) to provide long term tracing asvarious levels are crossed to aid in debugging performance and loadbalancing issues.

At the start of each write to NVS, the lock is obtained, and the variouscounters are checked to see if a new write can be allowed into NVS. Ifso, the segments are allocated for the write operation, the variouscounters are incremented, and long term tracing is performed if variouslevels are crossed.

For each discard operation from NVS, the lock is obtained, the variouscounters are decremented, and long term tracing is performed if variouslevels are crossed.

Due to the single lock, the above counter updates and tracing becomes animportant section of code for performance in, for example, amulti-processor control unit. As the number of processors increase,reducing this important section of code, without losing the capabilityto perform the above thresholding, becomes a requirement to increaseperformance. A need exists for a data management mechanism that acts toreduce this important section without loss of the previously mentionedcapability.

Some of the previously mentioned counters may not need to be accurate atall times for proper NVS thresholding. As a result, if all of thecounters are not updated every instance a write or discard operationoccurs from NVS, then the important section for the lock can be reduced,resulting in greater performance.

The mechanisms of the illustrated embodiments serve to categorizecounters that are deemed necessary to be updated per each instance of awrite or discard operation into one category, which is herein termed“accurate” counters, and an alternative, herein termed “fuzzy” countercategory, where it is not as important to maintain an accurate count pereach instance of the write and discard operation. By allowing those ofthe aforementioned counters not deemed to be necessary, the importantsection for the lock is reduced and performance is enhanced.

Turning to FIG. 1, a block diagram of one embodiment of a system 100 fordata management incorporating various aspects of the present inventionis illustrated. At least in the illustrated embodiment, system 100comprises a memory 102 coupled to a cache 104 and a processor 110 via abus 108 (e.g., a wired and/or wireless bus).

Memory 102 may be any type of memory device known in the art ordeveloped in the future. Examples of memory 102 include, but are notlimited to, an electrical connection having one or more wires, aportable computer diskette, a hard disk, a random access memory (RAM),an erasable programmable read-only memory (EPROM or Flash memory), anoptical fiber, a portable compact disc read-only memory (CD-ROM), anoptical storage device, a magnetic storage device, or any suitablecombination of the foregoing. In the various embodiments of memory 102,storage tracks are capable of being stored in memory 102. Furthermore,each of the storage tracks can be staged or destaged from/to memory 102from cache 104 when data is written to the storage tracks.

Cache 104, in one embodiment, comprises a write cache partitioned intoone or more ranks 106, where each rank 106 includes one or more storagetracks. Cache 104 may be any cache known in the art or developed in thefuture.

During operation, the storage tracks in each rank 106 are destaged tomemory 102 in a foreground destaging process after the storage trackshave been written to. That is, the foreground destage process destagesstorage tracks from the rank(s) 106 to memory 102 while a host (notshown) is actively writing to various storage tracks in the ranks 106 ofcache 104. Ideally, a particular storage track is not being destagedwhen one or more hosts desire to write to the particular storage track,which is known as a destage conflict.

In various embodiments, processor 110 comprises or has access to a datamanagement module 112, which comprises computer-readable code that, whenexecuted by processor 110, causes processor 110 to perform datamanagement operations in accordance with aspects of the illustratedembodiments. In the various embodiments, processor 110 divides aplurality of counters tracking write and discard storage operationsthrough Non Volatile Storage (NVS) space into first, accurate, andsecond, fuzzy, groups where the first, accurate, group is one ofincremented and decremented per each write and discard storageoperation, while the second, fuzzy, group is one of incremented anddecremented on a more infrequent basis as compared to the first,accurate group.

In various other embodiments, processor 110 determines which of theplurality of counters are to be categorized in which of the first andsecond groups of counters.

In various other embodiments, processor 110 removes the second groupfrom a critical section under a storage lock, thereby reducing thecritical section and improving performance.

In various other embodiments, processor 110 performs at least one of thewrite and discard storage operation.

In various other embodiments, processor 110, pursuant to performing thewrite operation, if the write operation is allowed, and pursuant to thediscard storage operation, updates the accurate group of counters.

In various other embodiments, processor 110, if a count of added orremoved segments reaches a predetermined threshold, updates the fuzzygroup of counters.

In various other embodiments, processor 110 enforces at least one of anNVS thresholding maximum value during at least a portion of theperformance of the write and discard storage operation.

FIG. 2 is a block diagram 200 illustrating an exemplary hardwarestructure of a data storage system in which aspects of the presentinvention may be implemented. Host computers 210, 220, 225, are shown,each acting as a central processing unit for performing data processingas part of a data storage system 200. The cluster hosts/nodes (physicalor virtual devices), 210, 220, and 225 may be one or more new physicaldevices or logical devices to accomplish the purposes of the presentinvention in the data storage system 200. A Network (e.g., storagefabric) connection 260 may be a fibre channel fabric, a fibre channelpoint-to-point link, a fibre channel over ethernet fabric or point topoint link, a FICON or ESCON I/O interface. The hosts, 210, 220, and 225may be local or distributed among one or more locations and may beequipped with any type of fabric (or fabric channel) (not shown in FIG.2) or network adapter 260 to the storage controller 240, such as Fibrechannel, FICON, ESCON, Ethernet, fiber optic, wireless, or coaxialadapters. Data storage system 200 is accordingly equipped with asuitable fabric (not shown in FIG. 2) or network adapter 260 tocommunicate. Data storage system 200 is depicted in FIG. 2 comprisingstorage controllers 240 and cluster hosts 210, 220, and 225. The clusterhosts 210, 220, and 225 may include cluster nodes.

To facilitate a clearer understanding of the methods described herein,storage controller 240 is shown in FIG. 2 as a single processing unit,including a microprocessor 242, system memory 243 and nonvolatilestorage (“NVS”) 216, which will be described in more detail below. It isnoted that in some embodiments, storage controller 240 is comprised ofmultiple processing units, each with their own processor complex andsystem memory, and interconnected by a dedicated network within datastorage system 200. Moreover, given the use of the storage fabricnetwork connection 260, additional architectural configurations may beemployed by using the storage fabric 260 to connect multiple storagecontrollers 240 together with one or more cluster hosts 210, 220, and225 connected to each storage controller 240.

In some embodiments, the system memory 243 of storage controller 240includes operation software 250 and stores program instructions and datawhich the processor 242 may access for executing functions and methodsteps associated with executing the steps and methods of the presentinvention. As shown in FIG. 2, system memory 243 may also include or bein communication with a cache 245, also referred to herein as a “cachememory”, for buffering “write data” and “read data”, which respectivelyrefer to write/read requests and their associated data. In oneembodiment, cache 245 is allocated in a device external to system memory243, yet remains accessible by microprocessor 242 and may serve toprovide additional security against data loss, in addition to carryingout the operations as described herein.

In some embodiments, cache 245 may be implemented with a volatile memoryand non-volatile memory and coupled to microprocessor 242 via a localbus (not shown in FIG. 2) for enhanced performance of data storagesystem 200. The NVS 216 included in data storage controller isaccessible by microprocessor 242 and serves to provide additionalsupport for operations and execution as described in other figures. TheNVS 216, may also referred to as a “persistent” cache, or “cache memory”and is implemented with nonvolatile memory that may or may not utilizeexternal power to retain data stored therein. The NVS may be stored inand with the cache 245 for any purposes suited to accomplish theobjectives of the present invention. In some embodiments, a backup powersource (not shown in FIG. 2), such as a battery, supplies NVS 216 withsufficient power to retain the data stored therein in case of power lossto data storage system 200. In certain embodiments, the capacity of NVS216 is less than or equal to the total capacity of cache 245.

The storage controller 240 may include a data management module 112. Thedata management module 112 may incorporate internal memory (not shown)in which the destaging algorithm may store unprocessed, processed, or“semi-processed” data. The data management module 112 may work inconjunction with each and every component of the storage controller 240,the hosts 210, 220, 225, and other storage controllers 240 and hosts210, 220, and 225 that may be remotely connected via the storage fabric260. Data management module 112 may be structurally one complete moduleor may be associated and/or included with other individual modules. Datamanagement module 112 may also be located in the cache 245 or othercomponents of the storage controller 240. Data management module 112,along with microprocessor 242 may implement aspects of the illustratedembodiments, such as establishing threshold factors as will be furtherdescribed.

The storage controller 240 includes a control switch 241 for controllinga protocol to control data transfer to or from the host computers 210,220, 225, a microprocessor 242 for controlling all the storagecontroller 240, a nonvolatile control memory 243 for storing amicroprogram (operation software) 250 for controlling the operation ofstorage controller 240, cache 245 for temporarily storing (buffering)data, and buffers 244 for assisting the cache 245 to read and writedata, and the data management module 112, in which information may beset. The multiple buffers 244 may be implemented to assist with themethods and steps as described herein.

Turning now to FIG. 3, a flow chart diagram, illustrating a generalizedmethod method 300 for data management, is depicted. Method 300 begins(step 302). A number of NVS write and discard operations is categorizedinto an “accurate” group, which is incremented/decremented at eachstorage transaction, and a “fuzzy” group, which isincremented/decremented on a less frequent basis (step 304). The method300 then ends (step 306).

Turning now to FIG. 4, an additional flow chart diagram of exemplaryoperations in which aspects of the illustrated embodiments areincorporated, is depicted. Method 400 begins (step 402) with adetermination of which counters and tracing must be categorized as“accurate” (step 404).

In a subsequent step, the method 400 determines which counters andtracing can be “fuzzy” (i.e., almost accurate within certain guidelines,but yet enable the maintenance of accurate NVS thresholding) (step 406).Various storage operations are then performed while accurate NVSthresholding techniques are performed (step 408). In accordance withsteps 404, 406, and 408, method 400 then removes the fuzzy counters andtracing from the critical section to improve performance (step 410). Themethod 400 then ends (step 412).

In one embodiment, various mechanisms for accurate NVS thresholding maybe implemented in conjunction with the maintenance of accurate and fuzzycounters. The mechanisms may take into account several NVS thresholdingfactors. The threshold factoring may be configured as follows.Individual ranks may be configured with a new threshold in addition tothe percentage basis of overall space (i.e., 25% of NVS). A “Rank NVSLimit” threshold may be defined as the minimum function of thepercentage threshold (again, i.e., 25% of NVS), and a defined “Rank NVSLimit for NVS Failback” benchmark for individual ranks.

In an additional embodiment, the Rank NVS Limit for NVS Failback may bedefined as a rank destage input/output per second (IOPS) metric,multiplied by a drain time, and multiplied by a minimum NVS allocation.

The Rank destage IOPS metric may, in one embodiment, be defined as anumber of destage IOPS a particular rank can do. This metric isdependent on the rank type and the drive types that make up a rank. Inone example, a RAID-5 Nearline rank may complete five hundred (500)IOPS. The aforementioned drain time may, in one embodiment, berepresented as the time that a failback operation takes to drain NVSduring a Quiesce/Resume operation. In one exemplary embodiment, thedrain time is set to about ten (10) minutes or 600 s. Finally, theaforementioned minimum NVS allocation may be represented as the minimumunit of NVS allocation. In one storage environment, the minimum NVSallocation is 4K (Kilobytes).

With all of the foregoing in view, consider the following example. Aparticular storage environment may have an accompanying rank NVS limitfor failback, with RAID-5 Nearline ranks, as (500 IOPS*600 s*4096) asapproximately equal to 1.2 GB.

An additional factor that may be used to determine the aforementionedrank NVS limit for failback is an amount of point-in-time copy sourcetracks in NVS. When a point-in-time copy source track is destaged, thetrack may require a Copy Source To Target (CST) operation before thesource track can be destaged. A CST operation may consume a large amountof resources since the operation needs to stage data from the source,and then destage the data to the target.

To accommodate source point-in-time copy tracks, the aforementioned rankNVS limit for failback may be further defined as follows. The metric maybe set equal to the aforementioned rank destage IOPS*drain time*minimumNVS allocation*the total tracks in NVS, divided by the total sourcepoint-in-time copy tracks in NVS*3+a total non-source point-in-copyracks in NVS. As one of ordinary skill in the art will appreciate,however, additional factors may be added or the aforementioned factorsmay be weighted to suit a particular application.

Turning now to FIG. 5, a flow chart diagram of additional exemplaryoperations, which may be undertaken in accordance with mechanisms of theillustrated embodiments, is depicted as method 500. Method 500 begins(step 502) with the creation of a new value (variable) for the number ofsegments added to NVS (step 504) to maintain synchronization. In anexample of this step, consider the following. In one storageenvironment, a value of 1,700 segments may be created (i.e., about 100tracks) to get the fuzzy counters in appropriate synchronization.

Method 500 continues with the creation of a new value (variable) for thenumber of segments removed from NVS to maintain synchronization (step506). Here again, in the context of the instant example, a value of1,700 segments may be created (again, about 100 tracks) to get the fuzzycounters in appropriate synchronization.

In step 508, counts of segments added and removed are set to zero. Foreach priority level (i.e., the maximum number of segments allowed), thepriority level is reduced by the value created in step 504, previously(step 510). In the context of the instant example, if a certain rankpriority level is 10,000 segments, then the reduced priority level isnow 8,300 (10,000−1,700). Finally, indicators (Booleans) are created foreach priority level to indicate if the particular level is below thereduced priority level when the fuzzy counters were updated (step 512).These indicators are checked for each write operation. The method 500then ends (step 514).

Turning now to FIG. 6, an additional flow chart illustrating anexemplary flow of various storage operations for the fuzzy and accuratecounters previously described, is depicted as method 600. Method 600begins (step 602) by querying whether the storage operation is a writeoperation (step 604). If so, the lock is obtained (step 606), and theaccurate counters and fuzzy indicators are then checked to see if awrite is allowed (step 608).

If the write is not allowed (step 610), the request is queued (step616). The method 600 then releases the lock (step 623) and proceeds tostep 624. Returning to step 610, if the write is allowed, the accuratecounters are updated (step 612), and the count of new segments addedmentioned previously is incremented (step 614). The method 600 thenagain releases the lock (again, step 623), and proceeds to step 624.

Returning to step 604, if the storage operation is not a write, but adiscard operation, the lock is obtained (step 618), the accuratecounters are updated (step 620), and the count of segments removedmentioned previously is incremented (step 622). The method 600 thenagain releases the lock (again, step 623) and proceeds to step 624.

In step 624, the method 600 queries whether the count of segments addedor removed reached the corresponding new values obtained in steps 504and 506 (FIG. 5, previously). If so, the fuzzy counters are updated tobe accurate (step 626), all long term tracing is performed based oncurrent information (step 628), and the count of segments added orremoved is reset to zero (step 630). The method 600 then returns to step604. Returning to step 624, if the count of segments added or removedhas not reached the corresponding new values, the method 600 thenreturns to step 604 as previously.

Additional modifications may be made to FIGS. 5 and 6. In an additionalembodiment, certain trigger events may be substituted or incorporated tothe query of step 624 to cause the fuzzy counters to be made accurate.These events may include such storage operations as a statesaveoperation or a rank state change operation.

The mechanisms of the illustrated embodiments, in view of the exemplaryfunctionality described in FIG. 5 and FIG. 6, previously, enable thefuzzy counters and long term tracing to not be inaccurate by more thanthe corresponding new values obtained in steps 504 and 506 (FIG. 5). Inaddition, the NVS thresholding factors or percentages are stillaccurately maintained. The critical section of code is reduced, whichincreases performance.

While at least one exemplary embodiment has been presented in theforegoing detailed description of the invention, it should beappreciated that a vast number of variations exist. It should also beappreciated that the exemplary embodiment or exemplary embodiments areonly examples, and are not intended to limit the scope, applicability,or configuration of the invention in any way. Rather, the foregoingdetailed description will provide those skilled in the art with aconvenient road map for implementing an exemplary embodiment of theinvention, it being understood that various changes may be made in thefunction and arrangement of elements described in an exemplaryembodiment without departing from the scope of the invention as setforth in the appended claims and their legal equivalents.

As will be appreciated by one of ordinary skill in the art, aspects ofthe present invention may be embodied as a system, method, or computerprogram product. Accordingly, aspects of the present invention may takethe form of an entirely hardware embodiment, an entirely softwareembodiment (including firmware, resident software, micro-code, etc.) oran embodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module,” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer-readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer-readable medium(s) may beutilized. The computer-readable medium may be a computer-readable signalmedium or a physical computer-readable storage medium. A physicalcomputer readable storage medium may be, for example, but not limitedto, an electronic, magnetic, optical, crystal, polymer, electromagnetic,infrared, or semiconductor system, apparatus, or device, or any suitablecombination of the foregoing. Examples of a physical computer-readablestorage medium include, but are not limited to, an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk,RAM, ROM, an EPROM, a Flash memory, an optical fiber, a CD-ROM, anoptical storage device, a magnetic storage device, or any suitablecombination of the foregoing. In the context of this document, acomputer-readable storage medium may be any tangible medium that cancontain, or store a program or data for use by or in connection with aninstruction execution system, apparatus, or device.

Computer code embodied on a computer-readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wired, optical fiber cable, radio frequency (RF), etc., or any suitablecombination of the foregoing. Computer code for carrying out operationsfor aspects of the present invention may be written in any staticlanguage, such as the “C” programming language or other similarprogramming language. The computer code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, or communication system, including, but notlimited to, a local area network (LAN) or a wide area network (WAN),Converged Network, or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described above with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in acomputer-readable medium that can direct a computer, other programmabledata processing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer-readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks. The computer program instructions may also beloaded onto a computer, other programmable data processing apparatus, orother devices to cause a series of operational steps to be performed onthe computer, other programmable apparatus or other devices to produce acomputer implemented process such that the instructions which execute onthe computer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the above figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

While one or more embodiments of the present invention have beenillustrated in detail, one of ordinary skill in the art will appreciatethat modifications and adaptations to those embodiments may be madewithout departing from the scope of the present invention as set forthin the following claims.

The invention claimed is:
 1. A method for data management by a processor device in a computing storage environment, comprising: dividing a plurality of counters tracking write and discard storage operations through Non Volatile Storage (NVS) space into first, accurate, and second, fuzzy, groups; and removing the second group from a critical section under a storage lock, thereby reducing the critical section and improving performance; wherein the first, accurate, group is one of updated on a per operation basis, while the second, fuzzy, group is one of updated on a more infrequent basis as compared to the first, accurate group.
 2. The method of claim 1, further including determining which of the plurality of counters are to be categorized in which of the first and second groups of counters.
 3. The method of claim 1, further including performing at least one of the write and discard storage operation.
 4. The method of claim 3, further including, pursuant to performing the write operation, if the write operation is allowed, and pursuant to the discard storage operation, updating the accurate group of counters.
 5. The method of claim 4, further including, if a count of added or removed segments reaches a predetermined threshold, updating the fuzzy group of counters.
 6. The method of claim 5, further including enforcing at least one of an NVS thresholding maximum value during at least a portion of the performance of the write and discard storage operation. 